Towards Makespan Minimization Task Allocation in Data Centers
نویسندگان
چکیده
Nowadays, data centers suffer from resource limitations in both the limited bandwidth resources on the links and the computing capability on the servers, which triggers a variety of resource management problems. In this paper, we discuss one classic resource allocation problem: task allocation in data centers. That is, given a set of tasks with different makespans, how to schedule these tasks into the data center to minimize the average makespan. Due to the tradeoff between locality and load balancing, along with the multi-layer topology of data centers, it is extremely time consuming to obtain an optimal result. To deal with the multi-layer topology, we first study a simple case of one-layer cluster and discuss the optimal solution. After that, we propose our hierarchical task allocation algorithm for multilayer clusters. Evaluation results prove the high efficiency of our algorithm. Keywords–Task allocation; Data centers; Makespan.
منابع مشابه
Multi-objective and Scalable Heuristic Algorithm for Workflow Task Scheduling in Utility Grids
To use services transparently in a distributed environment, the Utility Grids develop a cyber-infrastructure. The parameters of the Quality of Service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the Utility Grids. Optimization of both target parameters above is a challenge in a distributed environment and may conflict one an...
متن کاملSlack allocation algorithm for energy minimization in cluster systems
Energy consumption has been a critical issue in high-performance computing systems, such as clusters and data centers. An existing technique to reduce energy consumption of applications is dynamic voltage/frequency scaling (DVFS). In this paper, we present a novel algorithm called EASLA for energy aware scheduling of precedence-constrained applications in the context of Service Level Agreement ...
متن کاملA Systematic Review of Different Task Scheduling Algorithms in Cloud Computing
Cloud computing is an internet based Technology in which application, data, and Information services are provided over the internet. Cloud Computing is useful to share data and offer services transparently among its various users. As the number of users increases in cloud the task to be schedule also increase. The performance of the cloud depends on the scheduling algorithm use in task scheduli...
متن کاملScalable linear programming based resource allocation for makespan minimization in heterogeneous computing systems
Resource management for large-scale high performance computing systems poses difficult challenges to system administrators. The extreme scale of these modern systems require task scheduling algorithms that are capable of handling at least millions of tasks and thousands of machines. Highly scalable algorithms are necessary to efficiently schedule tasks to maintain the highest level of performan...
متن کاملA Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints
Parallel programs may be represented as a set of interrelated sequential tasks. When multiproces-sors are used to execute such programs, the parallel portion of the application can be speeded up by an appropriate allocation of processors to the tasks of the application. Given a parallel application deened by a task precedence graph, the goal of task scheduling (or processor assignment) is thus ...
متن کامل